Representable Idempotent Commutative Residuated Lattices

نویسنده

  • J. G. RAFTERY
چکیده

It is proved that the variety of representable idempotent commutative residuated lattices is locally finite. The n-generated subdirectly irreducible algebras in this variety are shown to have at most 3n+1 elements each. A constructive characterization of the subdirectly irreducible algebras is provided, with some applications. The main result implies that every finitely based extension of positive relevance logic containing the mingle and Gödel-Dummett axioms has a solvable deducibility problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal varieties of residuated lattices

In this paper we investigate the atomic level in the lattice of subvarieties of residuated lattices. In particular, we give infinitely many commutative atoms and construct continuum many non-commutative, representable atoms that satisfy the idempotent law; this answers Problem 8.6 of [12]. Moreover, we show that there are only two commutative idempotent atoms and only two cancellative atoms. Fi...

متن کامل

Minimal Varieties of Representable Commutative Residuated Lattices

We solve several open problems on the cardinality of atoms in the subvariety lattice of residuated lattices and FL-algebras [4, Problems 17–19, pp. 437]. Namely, we prove that the subvariety lattice of residuated lattices contains continuum many 4-potent commutative representable atoms. Analogous results apply also to atoms in the subvariety lattice of FLi-algebras and FLo-algebras. On the othe...

متن کامل

Commutative Idempotent Residuated Lattices

We investigate the variety of residuated lattices with a commutative and idempotent monoid reduct. A residuated lattice is an algebra A = (A,∨,∧, ·, e, /, \) such that (A,∨,∧) is a lattice, (A, ·, e) is a monoid and for every a, b, c ∈ A ab ≤ c ⇔ a ≤ c/b ⇔ b ≤ a\c. The last condition is equivalent to the fact that (A,∨,∧, ·, e) is a lattice-ordered monoid and for every a, b ∈ A there is a great...

متن کامل

An Overview of Residuated Kleene Algebras and Lattices

1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system for Residuated Kleene Lattices and some reducts 4. Interpreting Kleene algebras with tests 1. Residuated Lattices with iteration This talk is mostly about Residuated Kleene Lattices, which are defined as noncommutative residuated 0,1-lattices expanded with a unary operation * that satisfies x ...

متن کامل

Relation Algebras, Idempotent Semirings and Generalized Bunched Implication Algebras

This paper investigates connections between algebraic structures that are common in theoretical computer science and algebraic logic. Idempotent semirings are the basis of Kleene algebras, relation algebras, residuated lattices and bunched implication algebras. Extending a result of Chajda and Länger, we show that involutive residuated lattices are determined by a pair of dually isomorphic idem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007